/**
 * Created:	2001-7-
 * By:		eeorange
 * About: 	uva 10167 - Birthday Cake(生日蛋糕)
 * Status:	AC 0.152
 * Detail:	列举所有的可能值，相当暴力
 */

#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
using namespace std;

#define MAXN		110

int P[MAXN][2], N;

bool test(int A, int B){
	int neg = 0, pos = 0;
	for(int i=0; i< (N<<1); i++){
		int res = P[i][0] * A + P[i][1] * B;
		
		if(res < 0)
			neg++;
		else if(res > 0) 
			pos++;
		else 
			return false;
	}
	
	return neg == pos;
}


int main(){
	#ifdef LOCAL
		freopen("data.in", "r", stdin);
	#endif
	
	while(scanf("%d", &N) && N)
	{
		for(int i=0; i < (N<<1); i++) 
			scanf("%d%d", &P[i][0], &P[i][1]);

		bool more = true;
		for(int i=-500; i<=500 && more; i++)
		for(int j=-500; j<=500; j++) if(test(i, j))
		{
			printf("%d %d\n", i, j);
			more = false;
			break;
		}
	}
			
	
	#ifdef LOCAL
		printf("\nTime used = %.3lf\n", (double)clock()/CLOCKS_PER_SEC);
		printf("****** END ******\n");
	#endif
	return 0;
}


